An extended truth about heaps?
نویسندگان
چکیده
We describe a number of alternative implementations for the heap functions, which are part of the C++ standard library, and provide a through experimental evaluation of their performance. In our benchmarking framework the heap functions are implemented using the same set of utility functions, the utility functions using the same set of policy functions, and for each implementation alternative only the utility functions need be modified. This way the programs become homogeneous and the underlying methods can be compared fairly. Our benchmarks show that the conflicting results in earlier experimental studies are mainly due to test arrangements. No heapifying approach is universally the best for all kinds of inputs and ordering functions, but the bottom-up heapifying performs well for most kinds of inputs and ordering functions. We examine several approaches that improve the worst-case performance and make the heap functions even more trustworthy.
منابع مشابه
Theoretical and practical efficiency of priority queues
This is a study of the theoretical and practical efficiency of priority queues. The priority queue is an old and well studied data structure on which a great deal of theoretical and practical work has already been done. A priority queue can be realised in many ways, some of the most commonly used data structures for this are binary heaps and binomial queues. In this thesis the efficiency of pri...
متن کاملPlanning, Truth Criteria and the Systematic Approach to Action and Change Planning, Truth Criteria and the Systematic Approach to Action and Change
This paper presents an analysis of partial-order planning based on Sandewall's systematic approach to reasoning about action and change. The partial-order planner tweak is analysed and reconstructed. The main result is a temporal logic-based version of the criterion for necessary truth in tweak plans. In a second step, the tweak truth criterion is extended to deal with context-dependent and non...
متن کاملHeap – ternary algebraic structure ∗
In this paper some classes of ternary algebraic structures (semi-heaps, heaps) are considered. The connection between heaps (laterally commutative heaps) and corresponding algebraic and geometric structures is presented. The equivalence of heap existence and the Desargues system on the same set is directly proved. It is the starting point for an analogous result about a laterally commutative he...
متن کاملZipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size Systems
BACKGROUND Zipf's law and Heaps' law are observed in disparate complex systems. Of particular interests, these two laws often appear together. Many theoretical models and analyses are performed to understand their co-occurrence in real systems, but it still lacks a clear picture about their relation. METHODOLOGY/PRINCIPAL FINDINGS We show that the Heaps' law can be considered as a derivative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006